#include "Tree.h"
#include "Queue.h"
int main()
{
	char a[] = "ABD##E#H##CF##G##";
	//char a[] = "ABD##E##H##CF##G##";
	int i = 0;
	BTNode* root = BinaryTreeCreate(a, &i);
	printf("%d\n", BinaryTreeComplete(root));
	//BinaryTreeLevelOrder(root);

	/*BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");

	printf("%d\n", BinaryTreeSize(root));
	printf("%d\n", BinaryTreeLeafSize(root));
	printf("%d\n", BinaryTreeLevelKSize(root, 4));
	printf("%p\n", BinaryTreeFind(root, 'A'));*/
	
	BinaryTreeDestory(root);
	root = NULL;
	
	return 0;
}